var crypto/rsa.bigOne
11 uses
crypto/rsa (current package)
rsa.go#L43: var bigOne = big.NewInt(1)
rsa.go#L236: modulus := new(big.Int).Set(bigOne)
rsa.go#L239: if prime.Cmp(bigOne) <= 0 {
rsa.go#L257: pminus1 := new(big.Int).Sub(prime, bigOne)
rsa.go#L259: if congruence.Cmp(bigOne) != 0 {
rsa.go#L408: n := new(big.Int).Set(bigOne)
rsa.go#L409: totient := new(big.Int).Set(bigOne)
rsa.go#L413: pminus1.Sub(prime, bigOne)
rsa.go#L611: priv.Precomputed.Dp = new(big.Int).Sub(priv.Primes[0], bigOne)
rsa.go#L614: priv.Precomputed.Dq = new(big.Int).Sub(priv.Primes[1], bigOne)
rsa.go#L625: values.Exp = new(big.Int).Sub(prime, bigOne)
|
The pages are generated with Golds v0.6.7. (GOOS=linux GOARCH=amd64)
Golds is a Go 101 project developed by Tapir Liu.
PR and bug reports are welcome and can be submitted to the issue list.
Please follow @Go100and1 (reachable from the left QR code) to get the latest news of Golds. |